Cliques in Graphs Excluding a Complete Graph Minor
نویسندگان
چکیده
منابع مشابه
Cliques in Graphs Excluding a Complete Graph Minor
This paper considers the following question: What is the maximum number of k-cliques in an n-vertex graph with no Kt-minor? This question generalises the extremal function for Kt-minors, which corresponds to the k = 2 case. The exact answer is given for t 6 9 and all values of k. We also determine the maximum total number of cliques in an n-vertex graph with no Kt-minor for t 6 9. Several obser...
متن کاملCliques in Odd-Minor-Free Graphs
This paper is about: (1) bounds on the number of cliques in a graph in a particular class, and (2) algorithms for listing all cliques in a graph. We present a simple algorithm that lists all cliques in an n-vertex graph in O(n) time per clique. For O(1)-degenerate graphs, such as graphs excluding a fixed minor, we describe a O(n) time algorithm for listing all cliques. We prove that graphs excl...
متن کامل1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
We give polynomial-time constant-factor approximation algorithms for the treewidth and branchwidth of any H-minor-free graph for a given graph H with crossing number at most 1. The approximation factors are 1.5 for treewidth and 2.25 for branchwidth. In particular, our result directly applies to classes of nonplanar graphs such as K5-minorfree graphs and K3,3-minor-free graphs. Along the way, w...
متن کامل-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
We give polynomial-time constant-factor approximation algorithms for the treewidth and branchwidth of any H-minor-free graph for a given graph H with crossing number at most 1. The approximation factors are 1.5 for treewidth and 2.25 for branchwidth. In particular, our result directly applies to classes of nonplanar graphs such as K5-minorfree graphs and K3,3-minor-free graphs. Along the way, w...
متن کاملCompact Routing for Graphs Excluding a Fixed Minor
This paper concerns compact routing schemes with arbitrary node names. We present a compact name-independent routing scheme for unweighted networks with n nodes excluding a fixed minor. For any fixed minor, the scheme, constructible in polynomial time, has constant stretch factor and requires routing tables with poly-logarithmic number of bits at each node. For shortest-path labeled routing sch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2016
ISSN: 1077-8926
DOI: 10.37236/5715